Planar L-Drawings of Directed Graphs
نویسندگان
چکیده
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upwardplanar L-drawings. We show that directed st-graphs admitting an upward(resp. upward-rightward-) planar L-drawing are exactly those admitting a bitonic (resp. monotonically increasing) st-ordering. We give a lineartime algorithm that computes a bitonic (resp. monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.
منابع مشابه
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with ...
متن کاملAlgorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملOn the Perspectives Opened by Right Angle Crossing Drawings
Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the readability of a drawing if edges cross at right angles. We investigate to what extent RAC drawings can help in overcoming the limitations of widely a...
متن کاملDominance Drawing of Non-Planar Graphs
In information technology, big data is a term used to describe data sets so large and complex that they become awkward to work and analyze. Difficulties include capture, storage, search, sharing, analysis, and visualization. In this work we focus in the latter part, specifically we study the visualization of graphs. The need for simple and intuitive visualization techniques is more imminent tha...
متن کاملCircle planarity of level graphs
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests. A graph is a level graph, if it has a part...
متن کامل